Effective Decoding Algorithm of Three dimensional Product Code Decoding Scheme with Single Parity Check Code
نویسندگان
چکیده
منابع مشابه
Distributed decoding of rectangular parity-check code
Introduction: The goal of this Letter is to investigate the possibility of achieving spatial diversity without the use of physically connected antenna arrays by examining the simple case of a two-node network. We consider a pair of nodes that are connected via a communication channel that has relatively benign characteristics. Typically, these two nodes are in close proximity. For simplicity, w...
متن کاملLow-Density Parity-Check Code with Fast Decoding Speed
Low-Density Parity-Check (LDPC) codes received much attention recently due to their capacity-approaching performance. The iterative message-passing algorithm is a widely adopted decoding algorithm for LDPC codes [7]. An important design issue for LDPC codes is designing codes with fast decoding speed while maintaining capacityapproaching performance. In another words, it is desirable that the c...
متن کاملModified Algorithm on Maximum Detected Bit Flipping Decoding for High Dimensional Parity-Check Code
SUMMARY We have researched high dimensional parity-check (HDPC) codes that give good performance over a channel that has a very high error rate. HDPC code has a little coding overhead because of its simple structure. It has hard-in, maximum detected bit flipping (MDBF) decoding that has reasonable decoding performance and computational cost. In this paper, we propose a modified algorithm for MD...
متن کاملIterative Decoding of Product Code
Product codes based on binary block codes are considered. The aim is to use simple block codes as component codes in the constructions. Then, by using interleaving, large codes can be obtained. The fundamental aim of the interleaving is to obtain codes with a structure that is suitable for iterative decoding. We present interleaving strategies for iterative (turbo) decoding of block codes. A si...
متن کاملCode optimization, frozen glassy phase and improved decoding algorithms for low-density parity-check codes
The statistical physics properties of low-density parity-check codes for the binary symmetric channel are investigated as a spin glass problem with multi-spin interactions and quenched random fields by the cavity method. By evaluating the entropy function at the Nishimori temperature, we find that irregular constructions with heterogeneous degree distribution of check (bit) nodes have higher de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Korean Institute of Communications and Information Sciences
سال: 2016
ISSN: 1226-4717
DOI: 10.7840/kics.2016.41.9.1095